An $$O(n \log n)$$ Time Algorithm for Computing the Path-Length Distance Between Trees
نویسندگان
چکیده
منابع مشابه
A practical O(n log n) time algorithm for computing the triplet distance on binary trees
The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two rooted binary trees in time O ( n log n ) . The algorithm is related to an algorithm for computing t...
متن کاملAn Improved O ( R log log n + n ) Time Algorithm for Computing the Longest Common Subsequence
In this paper, we revisit the much studied LCS problem for two given sequences. Based on the algorithm of Iliopoulos and Rahman for solving the LCS problem, we have suggested 3 new improved algorithms. We first reformulate the problem in a very succinct form. The problem LCS is abstracted to an abstract data type DS on an ordered positive integer set with a special operation Update(S, x). For t...
متن کاملAn O(n log log n/ log n) Time Algorithm for the All-Pairs Shortest Path Problem
We design a faster algorithm for the all-pairs shortest path problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we improve the best known time complexity of O(n(log log n)/ logn) to O(n log log n/ log n). As an application, we show the k-maximum subarray problem can be solved in O(kn log log n/ log n) time for small k.
متن کاملAn O(n\log n)-Time Algorithm for the k-Center Problem in Trees
We consider a classical k-center problem in trees. Let T be a tree of n vertices and every vertex has a nonnegative weight. The problem is to find k centers on the edges of T such that the maximum weighted distance from all vertices to their closest centers is minimized. Megiddo and Tamir (SIAM J. Comput., 1983) gave an algorithm that can solve the problem in O(n log n) time by using Cole’s par...
متن کاملAn O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these items so that the portions of the two trees restricted to these items are isomorphic. We consider the case which occurs frequently in practice, i.e., the case when the trees are binary, and give an O(n logn) time algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2019
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-019-00594-5